工业园区混合能源优化配置方法应用与实践

为了充分挖掘多能源之间的互补潜力,使工业园区混合能源系统的配置方式由传统粗放式转变为精确优化配置并降低系统配置方案的保守性,基于粒子群联合CPLEX求解算法对工业园区的系统配置和运行调度方案进行分析优化,并以某生物园区为例进行了实例分析,得到了目标函数下的最优设计方案和运行策略。仿真分析结果表明,优化配置方法的应用能够协调冷热电多种能源的混合利用,提升系统的综合经济性。同时,为工业园区能源供应项目的规划、设计提供参考性支撑,丰富设计手段。     

超级计算机网络引导技术研究与分析

针对超级计算机系统中网络引导时间开销大的问题，提出网络引导分布算法是影响网络引导性能的主要因素之一，是优化网络引导性能的主要方向的观点。首先，分析了影响大规模网络引导性能的主要因素；其次，结合一种典型超级计算机系统，分析了超节点循环分布算法（SCDA）和插件循环分布算法（BCDA）的网络引导数据流拓扑结构；最后，量化分析了这两种算法对各个网络路径段的压力和可获得的网络性能，发现BCDA性能是SCDA性能的1~20倍。通过理论分析和模型推导发现，在计算节点和引导服务器之间使用更细粒度的映射算法可以在引导部分资源时使用尽量多的引导服务器，减少对局部网络资源的过早竞争，提升网络引导性能。     

基于改进的RS-TOPSIS模型的岩爆倾向性预测

针对目前岩爆倾向性中预测模型权重确定存在不足导致模型精度不高的现状，为更准确地预测岩爆倾向性，提出综合运用粗糙集理论中的代数观和信息观，确定属性最优权重，并修正岩爆倾向性与评价指标之间的关系，建立岩爆等级理想点矩阵。根据岩爆发生条件，选取岩石脆性指数、切应力指标和弹性应变能指数3项指标作为岩爆判别指标，以国内外20组典型岩爆数据为样本，建立改进的粗糙集—理想点法（RS-TOPSIS）岩爆倾向性预测模型，并应用该模型对玲珑金矿等工程实际进行了岩爆倾向性预测。结果表明：改进后样本预测精度相比于改进前有了显著提高，所建立的模型对实际工程的岩爆倾向性预测效果良好，预测结果更准确。     

Mining fleet management systems: a review of models and algorithms

The objective of this paper is to review and document the mine fleet management systems’ models and algorithms. The purpose is to understand the algorithms behind the fleet management systems and the proposed academic solutions in this area to identify any gaps in the current literature and to open up opportunities to establish research questions that need to be addressed in an integrated simulation and optimisation operational planning research framework. In this paper, we review industrial fleet management systems and the main academic algorithms behind such systems. The fleet management systems are divided into three subsequently related problems to review: shortest path, production optimisation and real-time dispatching. Finally, the limitations of current algorithms for fleet management systems are documented in terms of mining practice feasibility and optimality of the solution on large-scale problems. The results of this literature review enable us to evaluate the logical links between major components of an integrated simulation and optimisation operational planning framework with current theory of fleet management systems.     

基于哈希链的软件定义网络路径安全

针对软件定义网络中，控制器无法保证下发的网络策略能够在转发设备上得到正确执行的安全问题，提出一种新的转发路径监控安全方案。首先以控制器的全局视图能力为基础，设计了基于OpenFlow协议的路径凭据交互处理机制；然后采用哈希链和消息验证码作为生成和处理转发路径凭据信息的关键技术；最后在此基础上，对Ryu控制器和Open vSwitch开源交换机进行深度优化，添加相应处理流程，建立轻量级的路径安全机制。测试结果表明，该机制能够有效保证数据转发路径安全，吞吐量消耗比SDN数据层可信转发方案（SDNsec）降低20%以上，更适用于路径复杂的网络环境，但时延和CPU使用率的浮动超过15%，有待进一步优化。     

WSNs中规避攻击者的源位置隐私保护路由协议

为了保证无线传感器网络（Wireless Sensor Networks，WSNs）中的源节点位置隐私安全，同时实现安全性能和网络能耗的均衡，提出了WSNs中规避攻击者的源节点位置隐私路由协议，该协议假设节点具有检测攻击者的能力，通过发出危险警告消息使路由路径上的节点采取路由改变策略，使攻击者无法回溯到源节点，延长了源节点保持位置隐私的安全时间。理论分析和仿真实验表明，该协议在消耗较少的通信开销的情况下保证了源节点位置的高度隐私。     

A skeletal n-butane mechanism with integrated simplification method

A new skeletal mechanism of n-butane is developed for describing its ignition and combustion characteristics applicable over a wide range of conditions: initial temperature 690–1430 K, pressure 1–30 atm, and equivalence ratio 0.5–2.0. Starting with a detailed chemical reaction kinetic model of 230 species and 1328 reactions (Healy et al., Combust. Flame, 2010), the directed relation graph method is applied as the first step to derive a semi-detailed mechanism with 134 species. Then, the reaction path analysis in conjunction with temperature sensitivity analysis is used to remove the redundant species and reaction paths simultaneously under the condition of low-temperature and moderate-to-high temperatures, respectively. Finally, a skeletal n-butane mechanism consisting of 86 species and 373 reactions can be obtained. Mechanism validation indicates that the new developed skeletal mechanism is in good agreement with the detailed mechanism in predicting the global ignition and combustion characteristics. The new skeletal mechanism is further validated using extensive available literature data including rapid pressure machine ignition delay time, shock-tube ignition delay time, laminar flame speed, and jet-stirred reaction oxidation, covering a large range of temperatures, pressures, and equivalence ratios. The comparison results demonstrate that a satisfactory agreement between predictions and experimental measurements is achieved.     

Inverse reinforcement learning-based time-dependent A* planner for human-aware robot navigation with local vision

In an environment where robots coexist with humans, mobile robots should be human-aware and comply with humans' behavioural norms so as to not disturb humans' personal space and activities. In this work, we propose an inverse reinforcement learning-based time-dependent A* planner for human-aware robot navigation with local vision. In this method, the planning process of time-dependent A* is regarded as a Markov decision process and the cost function of the time-dependent A* is learned using the inverse reinforcement learning via capturing humans' demonstration trajectories. With this method, a robot can plan a path that complies with humans' behaviour patterns and the robot's kinematics. When constructing feature vectors of the cost function, considering the local vision characteristics, we propose a visual coverage feature for enabling robots to learn from how humans move in a limited visual field. The effectiveness of the proposed method has been validated by experiments in real-world scenarios: using this approach robots can effectively mimic human motion patterns when avoiding pedestrians; furthermore, in a limited visual field, robots can learn to choose a path that enables them to have the larger visual coverage which shows a better navigation performance.     

A stiffness parameter and truncation error criterion for adaptive path following in structural mechanics

We explore a truncation error criterion to steer adaptive step length refinement and coarsening in incremental-iterative path following procedures, applied to problems in large-deformation structural mechanics. Elaborating on ideas proposed by Bergan and collaborators in the 1970s, we first describe an easily computable scalar stiffness parameter whose sign and rate of change provide reliable information on the local behavior and complexity of the equilibrium path. We then derive a simple scaling law that adaptively adjusts the length of the next step based on the rate of change of the stiffness parameter at previous points on the path. We show that this scaling is equivalent to keeping a local truncation error constant in each step. We demonstrate with numerical examples that our adaptive method follows a path with a significantly reduced number of points compared to an analysis with uniform step length of the same fidelity level. A comparison with Abaqus illustrates that the truncation error criterion effectively concentrates points around the smallest-scale features of the path, which is generally not possible with automatic incrementation solely based on local convergence properties.